Overlap-freeness in infinite partial words
نویسندگان
چکیده
10 We prove that there exist infinitely many infinite overlap-free binary partial words. 11 Moreover, we show that these words can contain only one hole and the hole must 12 occur either in the first or in the second position. We define that a partial word is 13 k-overlap-free if it does not contain a factor of the form xyxyx where the length 14 of x is at least k. We prove that there exist infinitely many binary partial words 15 with an infinite number of holes which are 2-overlap-free. 16
منابع مشابه
A generalization of Thue freeness for partial words
This paper approaches the combinatorial problem of Thue freeness for partial words. Partial words are sequences over a finite alphabet that may contain a number of “holes.” First, we give an infinite word over a three-letter alphabet which avoids squares of length greater than two even after we replace an infinite number of positions with holes. Then, we give an infinite word over an eight-lett...
متن کاملA generalization of
This paper approaches the combinatorial problem of Thue freeness for partial words. Partial words are sequences over a finite alphabet that may contain a number of ―holes‖. First, we give an infinite word over a three-letter alphabet which avoids squares of length greater than two even after we replace an infinite number of positions with holes. Then, we give an infinite word over an eight-lett...
متن کاملPeriodicity algorithms and a conjecture on overlaps in partial words
We propose an algorithm that given as input a full word w of length n, and positive integers p and d, outputs, if any exists, a maximal pperiodic partial word contained in w with the property that no two holes are within distance d (so-called d-valid). Our algorithm runs in O(nd) time and is used for the study of repetition-freeness of partial words. Furthermore, we construct an infinite word o...
متن کاملFreeness of partial words
The paper approaches the classical combinatorial problem of freeness of words, in the more general case of partial words. First, we propose an algorithm that tests efficiently whether a partial word is kfree or not. Then, we show that there exist arbitrarily many cube-free infinite partial words containing an infinite number of holes, over binary alphabets; thus, there exist arbitrarily many k-...
متن کاملRestricted square property and infinite partial words
We prove that there exist infinitely many infinite overlap-free binary partial words containing at least one hole. Moreover, we show that these words cannot contain more than one hole and the only hole must occur either in the first or in the second position. We define that a partial word is k-overlap-free if it does not contain a factor of the form xyxyx where the length of x is at least k. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 410 شماره
صفحات -
تاریخ انتشار 2009